Novel bound contraction procedure for global optimization of bilinear MINLP problems with applications to water management problems
نویسندگان
چکیده
We propose a new method to obtain the global optimum of MINLP problems containing bilinearities. Our special method that contracts the bounds of one variable at a time allows reducing the gap between eceived in revised form 6 April 2010 ccepted 8 April 2010 vailable online 14 April 2010 eywords: athematical programming ptimization a linear lower bound and an upper bound obtained solving the original problem. Unlike some methods based on variable partitioning, our bound contraction procedure does not introduce new integers or intervals. We illustrate the method by applying it to water management problems. © 2010 Elsevier Ltd. All rights reserved.
منابع مشابه
A New Approach for Global Optimization of a Class of MINLP Problems with Applications to Water Management and Pooling Problems
One of the biggest challenges in solving optimization engineering problems is rooted in the nonlinearities and nonconvexities, which arise from bilinear terms corresponding to component material balances and/or concave functions used to estimate capital cost of equipments. The procedure proposed uses an MILP lower bound constructed using partitioning of certain variables, similar to the one use...
متن کاملGlobal Optimization of Water Management Problems Using Linear Relaxation and Bound Contraction Methods
In this paper, we present results of a recently developed global optimization method as applied to water management problems. Our method deals effectively with MINLP problems with bilinear and univariate concave terms. Bilinear terms show up in these problems as products of flow rates and concentrations in component balances. In turn, concave terms are typically associated with equipment costs.
متن کاملNonlinear and mixed-integer optimization in chemical process network systems
The use of networks allows the representation of a variety of important engineering problems. The treatment of a particular class of network applications, the Process Synthesis problem, is exposed in this paper. Process Synthesis seeks to develop systematically process owsheets that convert raw materials into desired products. In recent years, the optimization approach to process synthesis has ...
متن کاملGlobal Optimization of MINLP Problems in Process Synthesis and Design
Abstract : Two new methodologies for the global optimization of MINLP models, the Special structure Mixed Integer Nonlinear BB, SMIN– BB, and the General structure Mixed Integer Nonlinear BB, GMIN– BB, are presented. Their theoretical foundations provide guarantees that the global optimum solution of MINLPs involving twice–differentiable nonconvex functions in the continuous variables can be id...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computers & Chemical Engineering
دوره 35 شماره
صفحات -
تاریخ انتشار 2011